Scalings in Linear Programming: Necessary and Sufficient Conditions for Invariance
نویسندگان
چکیده
منابع مشابه
Scalings in Linear Programming: Necessary and Sufficient Conditions for Invariance
We analyze invariance of the conclusion of optimality for the linear programming problem under scalings (linear, affine, . . . ) of various problem parameters such as: the coefficients of the objective function, the coefficients of the constraint vector, the coefficients of one or more rows (columns) of the constraint matrix. Measurement theory concepts play a central role in our presentation a...
متن کاملNecessary and Sufficient Optimality Conditions for Fuzzy Linear Programming
This paper is concerned with deriving necessary and sufficient optimality conditions for a fuzzy linear programming problem. Toward this end, an equivalence between fuzzy and crisp linear programming problems is established by means of a specific ranking function. Under this setting, a main theorem gives optimality conditions which do not seem to be in conflict with the so-called Karush-Kuhn-Tu...
متن کاملNecessary and Sufficient Conditions for Linear Convergence of `1-Regularization
Motivated from the theoretical and practical results in compressed sensing, efforts have been undertaken by the inverse problems community to derive analogous results, for instance linear convergence rates, for Tikhonov regularization with `1-penalty term for the solution of ill-posed equations. Conceptually, the main difference between these two fields is that regularization in general is an u...
متن کاملNecessary and Sufficient Conditions for Distinguishability of Linear Control Systems
Distinguishability takes a crucial rule in studying observability of hybrid system such as switched system. Recently, for two linear systems, Lou and Si gave a condition not only necessary but also sufficient to the distinguishability of linear systems. However, the condition is not easy enough to verify. This paper will give a new equivalent condition which is relatively easy to verify.
متن کاملOn Linear Programming Duality and Necessary and Sufficient Conditions in Minimax Theory
In this paper we discuss necessary and sufficient conditions for different minimax results to hold using only linear programming duality and the finite intersection property for compact sets. It turns out that these necessary and sufficient conditions have a clear interpretation within zero-sum game theory. We apply these results to derive necessary and sufficient conditions for strong duality ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BRICS Report Series
سال: 1996
ISSN: 1601-5355,0909-0878
DOI: 10.7146/brics.v3i48.20050